Accelerating Boyer–Moore searches on binary texts

Accelerating Boyer Moore Searches on Binary Texts

The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blo...

Accelerating Braided B+ Tree Searches on a GPU with CUDA

Previous work has shown that using the GPU as a brute force method for SELECT statements on a SQLite database table yields significant speedups. However, this requires that the entire table be selected and transformed from the B-Tree to row-column format. This paper investigates possible speedups by traversing B+ Trees in parallel on the GPU, avoiding the overhead of selecting the entire table ...

Searches for Binary Stars in Globular Clusters

Accelerating kd-tree Searches for all k-nearest Neighbours

Finding the k nearest neighbours of each point in a point cloud forms an integral part of many point-cloud processing tasks. One common approach is to build a kd-tree over the points and then iteratively query the k nearest neighbors of each point. We introduce a simple modification to these queries to exploit the coherence between successive points; no changes are required to the kd-tree data ...

New Binary and Millisecond Pulsars from Arecibo Drift-Scan Searches

We discuss four recycled pulsars found in Arecibo drift-scan searches. PSR J1944+0907 has a spin period of 5.2ms and is isolated. The 5.8-ms pulsar J1453+19 may have a low-mass companion. The isolated 56-ms pulsar J0609+2130 is possibly the remnant of a disrupted double neutron star binary. The 41-ms pulsar J1829+2456 is in a relativistic orbit; its companion is most likely another neutron star.